On the domination number of $t$-constrained de Bruijn graphs

Motivated by the work on domination number of directed de Bruijn graphs and some its generalizations, in this paper we introduce a natural generalization (directed undirected), namely $t$-constrained graphs, where $t$ is positive integer, then study these graphs. Within definition Kautz correspond to 1-constrained 2-constrained respectively. This inherits many structural properties may have similar applications interconnection networks or bioinformatics. We establish upper lower bounds for both undirected case. These are often very close cases able find exact value.